Axiomatizing Higher Level Delimited Continuation
نویسنده
چکیده
In our previous work we gave a sound and complete axiomatization of the control operators for delimited continuations, shift and reset by Danvy and Filinski and their variants. Since the calculus allows only one use of shift and reset, a next step is to investigate the calculus with many different shift’s and reset’s. In this work, we study the calculus with higher-level delimited continuation operators, and give a sound and complete axiomatization of the calculus with level-1 and level-2 control operators for delimited continuations. Due to lack of space, we leave the detailed proof to a separate draft available at: http://logic.is.tsukuba.ac.jp/~kam/level2-proof.ps
منابع مشابه
Axiomatizing Subtyped Delimited Continuations
We present direct equational axiomatizations of the call-by-value lambda calculus with the control operators shift0 and reset0 that generalize Danvy and Filinski’s shift and reset in that they allow for abstracting control beyond the top-most delimited continuation. We address an untyped version of the calculus as well as a typed version with effect subtyping. For each of the calculi we present...
متن کاملA static simulation of dynamic delimited control
We present a continuation-passing-style (CPS) transformation for some dynamic delimited-control operators, including Felleisen’s control and prompt, that extends a standard call-by-value CPS transformation. Based on this new transformation, we show how Danvy and Filinski’s static delimited-control operators shift and reset simulate dynamic operators, allaying in passing some skepticism in the l...
متن کاملA type-theoretic foundation of delimited continuations
There is a correspondence between classical logic and programming language calculi with first-class continuations. With the addition of control delimiters, the continuations become composable and the calculi are believed to become more expressive. We formalise that the addition of control delimiters corresponds to the addition of a single dynamically-scoped variable modelling the special top-le...
متن کاملThe Theory and Practice of Programming Languages with Delimited Continuations
This dissertation presents a study of functional programming languages with first-class delimited continuations. We focus mainly on theoretical and practical aspects of Danvy and Filinski’s hierarchy of static delimited-control operators shiftn and resetn, and of Felleisen’s dynamic delimited-control operators control and prompt. Our study uses the traditional means of specifying semantics of f...
متن کاملDelimited continuations for prolog
Delimited continuations are a famous control primitive that originates in the functional programming world. It allows the programmer to suspend and capture the remaining part of a computation in order to resume it later. We put a new Prolog-compatible face on this primitive and specify its semantics by means of a metainterpreter. Moreover, we establish the power of delimited continuations in Pr...
متن کامل